The Perfect Matching Polytope and Solid Bricks The Matching Lattice and its Bases PoCo 2015 Summer School on Polyhedral Combinatorics
نویسندگان
چکیده
e∈F x(e). M denotes the set of all perfect matchings of G. χ denotes the incidence vector of M . Cuts: A cut of G is a subset of E that is the coboundary ∂(S) of some subset S of V . For a cut C := ∂(S), S and S are the shores of C. A cut is trivial if one of its shores is a singleton. A cut is odd if both its shores have odd cardinality. Note: This is the notation used in Bondy and Murty’s book “Graph Theory (2008)” [1]. Most optimizers use δ(S), and we ourselves used ∇(S) instead of ∂(S) in some of our papers [3]-[8].
منابع مشابه
São Paulo School of Advanced Science on Algorithms, Combinatorics and Optimization The Perfect Matching Polytope, Solid Bricks and the Perfect Matching Lattice
e∈F x(e). M denotes the set of all perfect matchings of G. χ denotes the incidence vector of M . Cuts: A cut of G is a subset of E that is the coboundary ∂(S) of some subset S of V . For a cut C := ∂(S), S and S are the shores of C. A cut is trivial if one of its shores is a singleton. A cut is odd if both its shores have odd cardinality. Note: This is the notation used in Bondy and Murty’s boo...
متن کاملOn the inverse maximum perfect matching problem under the bottleneck-type Hamming distance
Given an undirected network G(V,A,c) and a perfect matching M of G, the inverse maximum perfect matching problem consists of modifying minimally the elements of c so that M becomes a maximum perfect matching with respect to the modified vector. In this article, we consider the inverse problem when the modifications are measured by the weighted bottleneck-type Hamming distance. We propose an alg...
متن کاملMatching Integral Graphs of Small Order
In this paper, we study matching integral graphs of small order. A graph is called matching integral if the zeros of its matching polynomial are all integers. Matching integral graphs were first studied by Akbari, Khalashi, etc. They characterized all traceable graphs which are matching integral. They studied matching integral regular graphs. Furthermore, it has been shown that there is no matc...
متن کاملOn lower bounds on the number of perfect matchings in n-extendable bricks
Using elements of the structural theory of matchings and a recently proved conjecture concerning bricks, it is shown that every n-extendable brick (except K4, C6 and the Petersen graph) with p vertices and q edges contains at least q − p + (n − 1)!! perfect matchings. If the girth of such an n-extendable brick is at least five, then this graph has at least q − p + nn−1 perfect matchings. As a c...
متن کاملComplete forcing numbers of polyphenyl systems
The idea of “forcing” has long been used in many research fields, such as colorings, orientations, geodetics and dominating sets in graph theory, as well as Latin squares, block designs and Steiner systems in combinatorics (see [1] and the references therein). Recently, the forcing on perfect matchings has been attracting more researchers attention. A forcing set of M is a subset of M contained...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015